n, m = map(int, input().split())
ar = []
while n:
ar.append(n % m)
n //= m
if len(ar) == len(set(ar)):
print('YES')
else:
print('NO')#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define nl cout << "\n"
#define sort(v) sort(v.begin(),v.end())
#define loop(x,y) for(ll i = x;i < y;i++)
#define ts ll t; cin >> t;while
#define speedUp ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0);
using namespace std;
ll pr(ll n)
{
for (ll i = 2; i * i <= n; i++)
if (n % i == 0) return i;
return n;
}
int main()
{
speedUp;
// freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ll n, m; cin >> n >> m;
vector <ll> v;
set <ll> s;
while (n) {
v.push_back(n % m), s.emplace(n % m);
n /= m;
}
if (v.size() == s.size()) cout << "YES";
else cout << "NO";
return 0;
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |